The problem can be found at the following link: Question Link
To determine if two strings are isomorphic,
- I create two maps,
mp1
andmp2
, to store the mapping from characters instr1
tostr2
and vice versa. - I iterate through both strings simultaneously, updating the mappings.
- If at any point, the mapping doesn't hold, I return false.
- If the entire iteration completes without any mismatches, the strings are isomorphic.
- Time Complexity:
O(N)
, whereN
is the length of the input strings. - Auxiliary Space Complexity:
O(N)
, as we use two unordered maps.
class Solution {
public:
bool areIsomorphic(string str1, string str2) {
if (str1.size() != str2.size())
return false;
unordered_map<char, char> mp1, mp2;
for (int i = 0; i < str1.size(); i++) {
mp1[str1[i]] = str2[i];
mp2[str2[i]] = str1[i];
}
for (int i = 0; i < str1.size(); i++) {
if ((mp1[str1[i]] != str2[i]) || (mp2[str2[i]] != str1[i]))
return false;
}
return true;
}
};
For discussions, questions, or doubts related to this solution, please visit our discussion section. We welcome your input and aim to foster a collaborative learning environment.
If you find this solution helpful, consider supporting us by giving a ⭐ star to the getlost01/gfg-potd repository.